منابع مشابه
$C_4$-free zero-divisor graphs
In this paper we give a characterization for all commutative rings with $1$ whose zero-divisor graphs are $C_4$-free.
متن کاملOn zero-divisor graphs of quotient rings and complemented zero-divisor graphs
For an arbitrary ring $R$, the zero-divisor graph of $R$, denoted by $Gamma (R)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $R$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. It is well-known that for any commutative ring $R$, $Gamma (R) cong Gamma (T(R))$ where $T(R)$ is the (total) quotient ring of $R$. In this...
متن کاملGeneralized divisor problem
In 1952 H.E. Richert by means of the theory of Exponents Pairs (developed by J.G. van der Korput and E. Phillips ) improved the above O-term ( see [8] or [4] pag. 221 ). In 1969 E. Krätzel studied the three-dimensional problem. Besides, M.Vogts (1981) and A. Ivić (1981) got some interesting results which generalize the work of P.G. Schmidt of 1968. In 1987 A.Ivić obtained Ω-results for ∫ T 1 ∆ ...
متن کاملA generalization of zero-divisor graphs
In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores
متن کاملIrreducible Graphs
A connected graph on three or more vertices is said to be irreducible if it has no leaves, and if each vertex has a unique neighbor set. A connected graph on one or two vertices is also said to be irreducible, and a disconnected graph is irreducible if each of its connected components is irreducible. In this paper, we study the class of irreducible graphs. In particular, we consider an algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2014
ISSN: 0092-7872,1532-4125
DOI: 10.1080/00927872.2013.811246